Discrepancy Sets and Pseudorandom Generators for Combinatorical Rectangles
نویسندگان
چکیده
A common subproblem of $DNF$ approximate counting and derandomizing $RL$ is the discrepancy problem for combinatorial rectangles. We explicitly construct a $poly(n)$size sample space that approximates the volume of any combinatorial rectangle in $[n]^n$ to within $o(1)$ error (improving on the constructions of [EGLNV92]). The construction extends the techniques of [LLSZ95] for the analogous hitting set problem, most notably via discrepancy preserving reductions.
منابع مشابه
Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space that approximates the volume of any combinatorial rectangle in [n] to within o(1) error (improving on the constructions of [EGLNV92]). The construction extends the techniques of [LLSZ95] for the analogous hitting set pr...
متن کاملImproved Pseudorandom Generators for Combinatorial Rectangles
We construct a pseudorandom generator which uses O(log m + log d + log 3=2 1==) bits and approximates the volume of any combinatorial rectangle in f1; : : : ; mg d to within error. O(log m + log d + log 2 1==) bits. For a subclass of rectangles with at most t log 1== nontriv-ial dimensions and each dimension being an interval, we also give a pseudorandom generator using O(log log d + log 1== lo...
متن کاملSum-discrepancy test on pseudorandom number generators
We introduce a non-empirical test on pseudorandom number generators (prng), named sum-discrepancy test. We compute the distribution of the sum of consecutive m outputs of a prng to be tested, under the assumption that the initial state is uniformly randomly chosen. We measure its discrepancy from the ideal distribution, and then estimate the sample size which is necessary to reject the generato...
متن کاملOptimal Hitting Sets for Combinatorial Shapes
We consider the problem of constructing explicit Hitting sets for Combinatorial Shapes, a class of statistical tests first studied by Gopalan, Meka, Reingold, and Zuckerman (STOC 2011). These generalize many well-studied classes of tests, including symmetric functions and combinatorial rectangles. Generalizing results of Linial, Luby, Saks, and Zuckerman (Combinatorica 1997) and Rabani and Shpi...
متن کاملDirectional Discrepancy in Two Dimensions
In the present paper, we study the geometric discrepancy with respect to families of rotated rectangles. The well-known extremal cases are the axis-parallel rectangles (logarithmic discrepancy) and rectangles rotated in all possible directions (polynomial discrepancy). We study several intermediate situations: lacunary sequences of directions, lacunary sets of finite order, and sets with small ...
متن کامل